Termination Proof Script
Consider the TRS R consisting of the rewrite rule
|
| 1: |
|
a(b(a(b(x)))) |
→ b(a(b(a(a(b(x)))))) |
|
There are 2 dependency pairs:
|
| 2: |
|
A(b(a(b(x)))) |
→ A(b(a(a(b(x))))) |
| 3: |
|
A(b(a(b(x)))) |
→ A(a(b(x))) |
|
Consider the SCC {2,3}.
The constraints could not be solved.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006